Supervisory Control of Finite State Machines
نویسندگان
چکیده
We address a problem of nding a nite state machine (FSM), which composed with a given FSM, satisses a given speciication. The composition we use is the standard synchronous automata composition restricted to cases which correctly model hardware interconnection. For the satisfaction relation, we use language containment. We present a procedure that will generate a solution (if one exists) which is maximal, i.e. contains behaviors of all other solutions.
منابع مشابه
Model-driven migration of supervisory machine control architectures
Supervisory machine control is the high-level control in advanced manufacturing machines that is responsible for the coordination of manufacturing activities. Traditionally, the design of such control systems is based on finite state machines. An alternative, more flexible approach is based on task-resource models. This paper describes an approach for the migration of supervisory machine contro...
متن کاملCDC02-REG0793 Supervisory Control Problems of Hierarchical Finite State Machines
The situation under consideration is that of a given Discrete Event System (DES), whose behavior has to be modified by means of a feedback control (named Supervisor) in order to achieve a given set of requirements that the initial DES did not satisfy. To do so, the DES is modeled as a Hierarchical Finite State Machine (HFSM). Further, instead of translating the HFSM to ordinary state machines a...
متن کاملSupervisory Control Problems of Hierarchical Finite State Machines
Abstract The situation under consideration is that of a given Discrete Event System (DES), whose behavior has to be modified by means of a feedback control (named Supervisor) in order to achieve a given set of requirements that the initial DES did not satisfy. To do so, the DES is modeled as a Hierarchical Finite State Machine (HFSM). Further, instead of translating the HFSM to ordinary state m...
متن کاملSupervisory Control of Structured Discrete Event Systems
In this paper, the control of a class of Discrete Event Systems is investigated. Discrete event systems are modeled by a collection of loosely synchronous Finite State Machines. The basic problem of interest is to ensure the invariance of a set of particular configurations in the system. We provide algorithms that, based on a particular decomposition of the set of forbidden configurations, loca...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملStructural transformations of probabilistic finite state machines
Probabilistic finite state machines have recently emerged as a viable tool for modelling and analysis of complex non-linear dynamical systems. This paper rigorously establishes such models as finite encodings of probability measure spaces defined over symbol strings. The well known Nerode equivalence relation is generalized in the probabilistic setting and pertinent results on existence and uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995